Inductive Logic Programming: Inverse Resolution and Beyond

نویسنده

  • Stephen Muggleton
چکیده

This talk is based on a paper which appears in the May 1995 issue of New Generation Computing Journal under the title "Inverse entailment and Progol." The paper is available as gzipped Postscript by anonymous ftp from ftp.comlab.ox.ac.uk in file pub/Packages/ILP/Papers/InvEnt.ps.gz The paper firstly provides a reappraisal of the development of techniques for inverting deduction, secondly introduces Mode-Directed Inverse Entailment (MDIE) as a generalization and enhancement of previous approaches, and thirdly describes an implementation of MDIE in the Progol system. Progol is implemented in C and also available by anonymous ftp (details in main paper). The reassessment of previous techniques in terms of inverse entailment leads to new results for learning from positive data and inverting implication between pairs of clauses.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inductive Logic Programming Beyond Logical Implication

This paper discusses the generalization of deenite Horn programs beyond the ordering of logical implication. Since the seminal paper on generalization of clauses based on subsumption, there are various extensions in this area. Especially in inductive logic programming(ILP), people are using various methods that approximate logical implication, such as inverse resolution(IR), relative least gene...

متن کامل

Inverse Entailment for Full Clausal Theories

This paper shows a sound and complete method for inverse entailment in inductive logic programming. We show that inverse entailment can be computed with a resolution method for consequencending. In comparison with previous work, induction via consequencending is sound and complete for nding hypotheses from full clausal theories, and can be used for inducing not only de nite clauses but also non...

متن کامل

An Introduction to Inductive Logic Programming and Learning Language in Logic

This chapter introduces Inductive Logic Programming (ILP) and Learning Language in Logic (LLL). No previous knowledge of logic programming, ILP or LLL is assumed. Elementary topics are covered and more advanced topics are discussed. For example, in the ILP section we discuss subsumption, inverse resolution, least general generalisation, relative least general generalisation, inverse entailment,...

متن کامل

An Application of Fuzzy Inductive Logic Programming for Textual Entailment and Value Mining

The aim of this preliminary report is to give an overview of textual entailment in natural language processing (NLP), to present our approach to research and to explain the possible applications for such a system. Our system presupposes several modules, namely the sentiment analysis module, the anaphora resolution module, the named entity recognition module and the relationship extraction modul...

متن کامل

An Entity-Mention Model for Coreference Resolution with Inductive Logic Programming

The traditional mention-pair model for coreference resolution cannot capture information beyond mention pairs for both learning and testing. To deal with this problem, we present an expressive entity-mention model that performs coreference resolution at an entity level. The model adopts the Inductive Logic Programming (ILP) algorithm, which provides a relational way to organize different knowle...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995